Collective proposal distributions for nonlinear MCMC samplers: Mean-field theory and fast implementation

نویسندگان

چکیده

Over the last decades, various “non-linear” MCMC methods have arisen. While appealing for their convergence speed and efficiency, practical implementation theoretical study remain challenging. In this paper, we introduce a non-linear generalization of Metropolis-Hastings algorithm to proposal that depends not only on current state, but also its law. We propose simulate dynamics as mean field limit system interacting particles, can in turn itself be understood generalisation population particles. Under double number iterations particles prove converges. Then, an efficient GPU illustrate performance examples. The method is particularly stable multimodal examples converges faster than classical methods.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Proposal Distributions and Adaptive MCMC

We review recent work concerning optimal proposal scalings for Metropolis-Hastings MCMC algorithms, and adaptive MCMC algorithms for trying to improve the algorithm on the fly.

متن کامل

Mean Field Theory for Lossy Nonlinear Composites

The mean-field theory for lossy nonlinear composites, described by complex and field-dependent dielectric functions, is presented. By using the spectral representation of linear composites with identical microstructure, we develop self-consistent equations for the effective response. We examine two types of microstructure, namely, the Maxwell-Garnett approximation and the effective medium appro...

متن کامل

A Mean Field Theory of Nonlinear Filtering

We present a mean field particle theory for the numerical approximation of Feynman-Kac path integrals in the context of nonlinear filtering. We show that the conditional distribution of the signal paths given a series of noisy and partial observation data is approximated by the occupation measure of a genealogical tree model associated with mean field interacting particle model. The complete hi...

متن کامل

Automating and evaluating reversible jump MCMC proposal distributions

The reversible jump Markov chain Monte Carlo (MCMC) sampler (Green 1995) has become an invaluable device for Bayesian practitioners. However, the primary difficulty with the sampler lies with the efficient construction of transitions between competing models of possibly differing dimensionality and interpretation. We propose use of a marginal density estimator to construct between-model proposa...

متن کامل

Optimal Proposal Distributions and Adaptive MCMC by Jeffrey

We review recent work concerning optimal proposal scalings for Metropolis-Hastings MCMC algorithms, and adaptive MCMC algorithms for trying to improve the algorithm on the fly.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Journal of Statistics

سال: 2022

ISSN: ['1935-7524']

DOI: https://doi.org/10.1214/22-ejs2091